/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const ll mod = (1e9) + 7;

// ll pow_c(ll)

ll pow_c(ll a, ll b)
{
    ll sum = 0;
    while (b)
    {
        if (b & 1)
        {
            sum = (sum + a) % mod;
        }
        b >>= 1;
        a = (a + a) % mod;
    }
    return sum;
}

ll pow_m(ll a, ll b)
{
    ll sum = 1;
    while (b)
    {
        if (b & 1)
        {
            sum = pow_c(sum, a);
        }
        b >>= 1;
        a = pow_c(a, a);
    }
    return sum;
}

int main()
{
    IOS;
    ll n;
    cin >> n;
    cout << pow_c(n + 1, pow_m(n * 2, mod - 2)) << endl;
    getchar();
    getchar();
    return 0;
}
